Triangulating and Guarding Realistic Polygons
نویسندگان
چکیده
We propose a new model of realistic input: k-guardable objects. An object is k-guardable if its boundary can be seen by k guards in the interior of the object. In this abstract, we describe a simple algorithm for triangulating k-guardable polygons. Our algorithm, which is easily implementable, takes linear time assuming that k is constant.
منابع مشابه
Guarding Fat Polygons and Triangulating Guarded Polygons
In this paper we study three related problems: (i) Given a fat polygon P , we show how to find a set G of points in P such that every point on the boundary of P sees at least one point of G. The set G is said to guard the boundary of P and its cardinality depends on the shape parameters of P . Fat polygons are often used to model more realistic inputs. (ii) Given k points that guard the boundar...
متن کاملOn Guarding Orthogonal Polygons with Bounded Treewidth
There exist many variants of guarding an orthogonal polygon in an orthogonal fashion: sometimes a guard can see an entire rectangle, or along a staircase, or along a orthogonal path with at most k bends. In this paper, we study all these guarding models in the special case of orthogonal polygons that have bounded treewidth in some sense. Exploiting algorithms for graphs of bounded treewidth, we...
متن کاملAltitude Terrain Guarding and Guarding Uni-Monotone Polygons
We show that the problem of guarding an x-monotone terrain from an altitude line and the problem of guarding a uni-monotone polygon are equivalent. We present a polynomial time algorithm for both problems, and show that the cardinality of a minimum guard set and the cardinality of a maximum witness set coincide. Thus, uni-monotone polygons are perfect; this result also extends to monotone mount...
متن کاملAn Algorithm for Triangulating 3D Polygons
OF THE THESIS AN ALGORITHM FOR TRIANGULATING 3D POLYGONS by Ming Zou Master of Science in Computer Science Washington University in St. Louis, December 2013 Research Advisor: Professor Tao Ju In this thesis, we present an algorithm for obtaining a triangulation of multiple, non-planar 3D polygons. The output minimizes additive weights, such as the total triangle areas or the total dihedral angl...
متن کاملA Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons
Seidel, R., A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons, Computational Geometry: Theory and Applications 1 (1991) 51-64. This paper presents a very simple incremental randomized algorithm for computing the trapezoidal decomposition induced by a set S of n line segments in the plane. If S is given as a simple polygona...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 47 شماره
صفحات -
تاریخ انتشار 2008